Construction of magic rectangles of odd order

نویسندگان

  • Feng-Shun Chai
  • Ashish Das
  • Chand Midha
چکیده

Magic rectangles are well-known for their very interesting and entertaining combinatorics. Such magic rectangles have also been used in designing experiments. In a magic rectangle, the integers 1 to pq are arranged in an array of p rows and q columns so that each row adds to the same total P and each column to the same total Q. In the present paper we provide a systematic method for constructing a p by q magic rectangle where p > 1 and q > 1 are any odd integers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Magic Rectangles

Our purpose is to introduce a linear-algebraic construction for magic rectangles of size pr × ps, where p is prime and 1 ≤ r ≤ s. For fixed p, r, and s, this method allows for the production of many different magic rectangles. It follows that, for many non-coprime dimensions, this construction will significantly augment the sparse collection of “known” magic rectangles. A magic rectangle of siz...

متن کامل

A matrix approach to construct magic rectangles of even order

Magic rectangles are well-known for its very interesting and entertaining combinatorics. In a magic rectangle, the numbers 1 to mn are arranged in an array of m rows and n columns so that each row adds to the same total M and each column to the same total N . In the present paper we provide a new systematic method for constructing any even by even magic rectangle. The method proposed is extreme...

متن کامل

Numerical Enumeration of Greco-Latin Prime Order Associative Magic Squares

A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin...

متن کامل

Totally magic cordial labeling of some graphs

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

متن کامل

Magic rectangle sets of odd order

A magic rectangle set M = MRS(a, b; c) is a collection of c arrays (a × b) whose entries are elements of {1, 2, . . . , abc}, each appearing once, with all row sums in every rectangle equal to a constant ρ and all column sums in every rectangle equal to a constant σ. It was proved in [2] that if an MRS(a, b; c) exists, then a ≡ b (mod 2). It was also proved there that if a ≡ b ≡ 0 (mod 2) and b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2013